Vertex Cover Might be Hard to Approximate to within 2-\varepsilon
نویسندگان
چکیده
Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [Khot02], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.
منابع مشابه
No Small Linear Program Approximates Vertex Cover within a Factor 2-ε
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [30, 31] proved that the problem is NP-hard to approximate within a factor 2 − ε, assuming the Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for ...
متن کاملDeterministic Approximate Counting of Depth-2 Circuits
We describe deterministic algorithms which for a given depth-2 circuit $F$ approximate the probability that on a random input $F$ outputs a specific value $\alpha$. Our approach gives an algorithm which for a given $GF[2]$ multivariate polynomial $p$ and given $\varepsilon >0$ approximates the number of zeros of $p$ within a multiplicative factor $1+ \varepsilon$. The algorithm runs in time $ex...
متن کاملA 2-approximation NC algorithm for connected vertex cover and tree cover
The connected vertex cover problem is a variant of the vertex cover problem, in which a vertex cover is additional required to induce a connected subgraph in a given connected graph. The problem is known to be NP-hard and to be at least as hard to approximate as the vertex cover problem is. While several 2-approximation NC algorithms are known for vertex cover, whether unweighted or weighted, n...
متن کاملOn Some Approximation Algorithms for Dense Vertex Cover Problem
In this work we study the performance of some algorithms approximating the vertex cover problem (VCP) with respect to density constraints. We consider a modiication of the algorithm of Karpinski and Zelikovsky 9] for the weighted VCP and prove a performance guarantee for this algorithm in terms of a new density parameter. Also we investigate the hardness of approximation for the VCP on everywhe...
متن کاملStabbing Polygonal Chains with Rays is Hard to Approximate
We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 74 شماره
صفحات -
تاریخ انتشار 2003